#include <bits/stdc++.h>

#define eb emplace_back
#define ep emplace
#define fi first
#define se second
#define in read<int>()
#define lin read<ll>()
#define rep(i, x, y) for(int i = (x); i <= (y); i++)
#define per(i, x, y) for(int i = (x); i >= (y); i--)

using namespace std;

using ll = long long;
using db = double;
using pii = pair < int, int >;
using vec = vector < int >;
using veg = vector < pii >;

template < typename T > T read() {
	T x = 0; bool f = 0; char ch = getchar();
	while(!isdigit(ch)) f |= ch == '-', ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar();
	return f ? -x : x;
}

template < typename T > void chkmax(T &x, const T &y) { x = x > y ? x : y; }
template < typename T > void chkmin(T &x, const T &y) { x = x < y ? x : y; }

const int N = 5e4 + 10;
const int B = 200;
const int TB = N / B + 10;

int n, a[N];
int bel[N], bl[TB], br[TB], tag[TB];

void add(int l, int r, int c) {
	if(bel[l] == bel[r]) {
		rep(i, l, r) a[i] += c;
	} else {
		rep(i, bel[l] + 1, bel[r] - 1) tag[i] += c;
		rep(i, l, br[bel[l]]) a[i] += c;
		rep(i, bl[bel[r]], r) a[i] += c;
	}
}

int main() {
#ifdef YJR_2333_TEST
	freopen("1.in", "r", stdin);
#endif
	n = in; rep(i, 1, n) a[i] = in, bel[i] = (i - 1) / B + 1;
	rep(i, 1, n) {
		if(!bl[bel[i]]) bl[bel[i]] = i;
		br[bel[i]] = i;
	}
	rep(i, 1, n) {
		int op = in, l = in, r = in, c = in;
		if(op == 0) add(l, r, c);
		else printf("%d\n", a[r] + tag[bel[r]]);
	}
	return 0;
}
